On Some Separability, Reducibility and Controllability Criteria of RLCM Networks over F(Z)
نویسندگان
چکیده
The separability of a resistor-inductorcapacitor-mutual inductance (RLCM) network is defined in this paper. Some separability, reducibility and controllability (observability) criteria of RLCM networks over ( ) F z are derived. Two illustrative examples are given. Index Term—RLCM Networks, Separability, Reducibility, Controllability
منابع مشابه
Complete Reducibility and Separability
Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the interaction between the notion of separability and Serre’s concept of Gcomplete reducibility for subgroups of G. A separability hypothesis appears in many general th...
متن کاملBranch Merge Reduction of RLCM Networks
In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted at parasitic extractors for verification of VLSI designs, the proposed algorithm uses a branch merge, node elimination methodology, with the choice of nodes for elimination being guided by time-constant criteria. Reliabl...
متن کاملOn ideals of ideals in $C(X)$
In this article, we have characterized ideals in $C(X)$ in which every ideal is also an ideal (a $z$-ideal) of $C(X)$. Motivated by this characterization, we observe that $C_infty(X)$ is a regular ring if and only if every open locally compact $sigma$-compact subset of $X$ is finite. Concerning prime ideals, it is shown that the sum of every two prime (semiprime) ideals of e...
متن کاملReducibility of Polynomials
Reducibility without qualification means in this lecture reducibility over the rational field. Questions on such reducibility occupy an intermediate place between questions on reducibility of polynomials over an algebraically closed field and those on primality. I shall refer to these two cases as to the algebraic and the arithmetic one and I shall try to exhibit some of the analogies consideri...
متن کاملExtending Recurrence Local Computation Approach Towards Ordering Composite Beliefs in Multiply Connected Bayesian Belief Networks
The Recurrence Local Computation Method (RLCM) for nding the most probable explanations (MPE) in a Bayesian belief network is valuable in assisting human beings to explain the possible causes of a set of evidences. However, RLCM works only on singly connected belief networks. This paper presents an extension of the RLCM which can be applied to multiply connected belief networks for nding arbitr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JNW
دوره 8 شماره
صفحات -
تاریخ انتشار 2013